PCP goes organic
نویسندگان
چکیده
منابع مشابه
Pcp Verifiers
Definition 1 ((r, q)-verifier) An algorithm V is an (r, q)-verifier for a language L if on input strings x and y: step 1 V reads input x and draws r random bits ρ ∈ {0, 1}. step 2 V decides (after a polynomial-time computation in |x|) on q indexes: i1, . . . , iq and on a predicate φ : {0, 1} → {0, 1}. step 3 V outputs φ(y[i1], . . . , y[iq]). and the following holds, 1. (Completeness) If x ∈ L...
متن کاملInteractive PCP
An interactive-PCP (say, for the membership x ∈ L) is a proof that can be verified by reading only one of its bits, with the help of a very short interactive-proof. We show that for membership in some languages L, there are interactive-PCPs that are significantly shorter than the known (non-interactive) PCPs for these languages. Our main result is that the satisfiability of a constant depth Boo...
متن کاملAs iron goes, so goes disease?
The brain iron overload disorders, collectively known as neurodegeneration with brain iron accumulation (NBIA), would seem to be tantalizing targets for chelation therapy. Efforts to lower brain iron in these disorders date back to the 1960s with deferoxamine mesylate, but systemic iron depletion limited its use. With the advent of chelators better able to specifically relieve central nervous s...
متن کاملAround the Pcp Theorem
jeev Arora, from Princeton, was the guest speaker. The participants thus had a unique occasion to hear about what is arguably the most spectacular result in the history of computational complexity from someone who was deeply involved in its development. Many thanks to the note-takers, and very, very special thank you to Sanjeev who was so generous with his time and energy.
متن کاملThe Quantum PCP Conjecture
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop tools that address the question: does a quantum version of the PCP theorem hold? The story of this study starts with classical complexity and takes unexpecte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Organogenesis
سال: 2011
ISSN: 1547-6278,1555-8592
DOI: 10.4161/org.7.3.18676